Distributed end-host multicast algorithms for the Knowledge Grid
نویسندگان
چکیده
1Mobile and Internet Systems Laboratory, Department of Computer Science, University College Cork, Cork, Ireland 2Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong 3The China Knowledge Grid Research Group, Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, People’s Republic of China
منابع مشابه
Special Issue: Progress of the Knowledge Grid
This special issue contains five papers [1–5] reflecting the progress of the Knowledge Grid [6]. Most of them were selected from the First International Conference on Semantics, Knowledge and Grid (SKG2005; http://www.knowledgegrid.net), which is currently the unique forum crossing the areas of knowledge sharing, semantic networking and Grid computing. The first paper [1] proposes a distributed...
متن کاملAgents for enhanced end-host multicasting in distributed simulation systems
SUMMARY This report studies the use of distributed agents to improve the communication efficiency and effectiveness of XMSF-based simulations. We first present some basic architectural background on the use of agents with current work in Web Services and the Semantic Web. Using an existing multicast-enabled HLA simulation system as a starting point, we suggest an approach for " agentifying " th...
متن کاملMulticast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach
Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...
متن کاملMobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach
Please cite this article in press as: J. Akbari Tork learning automata approach, Comput. Commun During the last decades, many studies have been conducted on multicast routing in mobile ad hoc networks (MANET) and a host of algorithms have been proposed. In existing algorithms, the mobility characteristics are assumed to be constant, and so they do not scale well when the mobility parameters are...
متن کاملStrategyproof Mechanisms for Dynamic Multicast Tree Formation in Overlay Networks
In overlay multicast, every end host forwards multicast data to other end hosts in order to disseminate data. However, this cooperative behavior cannot be taken for granted, since each overlay node is now an intelligent end host, rather than an obedient router as in IP multicast. Ideally, a strategyproof mechanism should be provided to motivate cooperations among overlay nodes so that a mutuall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Concurrency and Computation: Practice and Experience
دوره 19 شماره
صفحات -
تاریخ انتشار 2007